منابع مشابه
On sumfree subsets of hypercubes
We consider the possible sizes of large sumfree sets contained in the discrete hypercube {1, . . . , n}k, and we determine upper and lower bounds for the maximal size as n becomes large. We also discuss a continuous analogue in which our lower bound remains valid and our upper bound can be strengthened, and we consider the generalization of both problems to l-fold-sumfree sets.
متن کاملMimd{factorisation on Hypercubes Mimd-factorisation on Hypercubes
This paper describes the development and implementation of the MPQS factoring algorithm using multiple hypercubes customised to a MIMD parallel computer. The computationally most expensive steps ran on a Parsytec machine consisting of 1024 Inmos T805 microprocessors. General 100 decimal digit numbers can be factored in 1{2 days.
متن کاملBroadcasting on Faulty Hypercubes
In this paper we propose a method for constructing the maximum number of edge-disjoint spanning trees (in the directed sense) on a hypercube with arbitrary one faulty node. Each spanning tree is of optimal height. By taking the common neighbor of the roots of these edge-disjoint spanning trees as the new root and reversing the direction of the directed link from each root to the new root, a spa...
متن کاملOn Recursively Directed Hypercubes
In this paper we introduce the recursively directed hypercubes, and analyze some of their structural properties. We show that every recursively directed hypercube is acyclic, and has a unique pair of source and sink nodes. The main contribution of the paper is an analysis of distances between the nodes in such a graph. We show that the distance from the source node to any other node, and from a...
متن کاملA Lower Bound on Embedding Large Hypercubes into Small Hypercubes
The problem of embedding an N -processor architecture G into an M -processor architecture H for N > M arises when algorithms designed for architectures of an ideal size are simulated on existing architectures which are of a xed size. In this paper we present solutions to this embedding problem for the case when both architectures are hypercubes and the embeddings are to achieve a balanced load....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 2009
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa137-2-3